Rainbow vertex pair-pancyclicity of strongly edge-colored graphs

An edge-colored graph is \emph{rainbow }if no two edges of the have same color. $G^c$ called \emph{properly colored} if every adjacent receive distinct colors in $G^c$. A \emph{strongly edge-colored} a proper such that path length $3$ rainbow. We call an vertex pair-pancyclic} any vertices are contained rainbow cycle $\ell$ for each with $3 \leq \ell n$. In this paper, we show strongly order $n$ minimum degree $\delta \geq \frac{2n}{3}+1$ pair-pancyclicity.